A Hybrid Metaheuristic Algorithm for the Capacitated Location- Routing Problem

نویسندگان

  • John Willmer Escobar
  • Rodrigo Linfati
  • Paolo Toth
چکیده

This paper presents a new metahaheuristic algorithm to solve the capacitated locationrouting problem (CLRP). We are given on input a set of identical vehicles, a set of depots with restricted capacities and opening costs, and a set of customers with deterministic demands. The problem consists of determining the depots to be opened, the customers and the vehicles to be assigned to each open depot, and the routes to be performed. The objective is to minimize the sum of the costs of the open depots, of the fixed cost associated with the used vehicles, and of the variable traveling costs related to the performed routes. In the proposed algorithm, a modified granular tabu search with different diversification strategies is applied. Computational experiments on benchmark instances show that the proposed algorithm is able to produce, within short computing time, several solutions obtained by the previously published methods and new best known solutions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving a robust capacitated arc routing problem using a hybrid simulated annealing algorithm: A waste collection application

The urban waste collection is one of the major municipal activities that involves large expenditures and difficult operational problems. Also, waste collection and disposal have high expenses such as investment cost (i.e. vehicles fleet) and high operational cost (i.e. fuel, maintenance). In fact, making slight improvements in this issue lead to a huge saving in municipal consumption. Some inci...

متن کامل

Solving a bi-objective mathematical model for location-routing problem with time windows in multi-echelon reverse logistics using metaheuristic procedure

During the last decade, the stringent pressures from environmental and social requirements have spurred an interest in designing a reverse logistics (RL) network. The success of a logistics system may depend on the decisions of the facilities locations and vehicle routings. The location-routing problem (LRP) simultaneously locates the facilities and designs the travel routes for vehicles among ...

متن کامل

A Hybrid Heuristic Algorithm to Solve Capacitated Location-routing Problem With Fuzzy ‎Demands‎

In this paper, the capacitated location-routing problem with fuzzy demands (CLRP-FD) is considered. The CLRP-FD is composed of two well-known problems: facility location problem and vehicle routing problem. The problem has many real-life applications of which some have been addressed in the literature such as management of hazardous wastes and food and drink distribution. In CLRP-FD, a set of c...

متن کامل

An Efficient Hybrid Metaheuristic for Capacitated p-Median Problem

Capacitated p-median problem (CPMP) is a well-known facility-location problem, in which p capacitated facility points are selected to satisfy n demand points in such a way that the total assigned demand to each facility does not exceed its capacity. Minimizing the total sum of distances between each demand point and its nearest facility point is the objective of the problem. Developing an effic...

متن کامل

A Combined Metaheuristic Algorithm for the Vehicle Routing Problem and its Open Version

Abstract: The Open Vehicle Routing Problem (OVRP) is one of the most important extensions of the vehicle routing problem (VRP) that has many applications in industrial and service. In the VRP, a set of customers with a specified demand of goods are given and a depot where a fleet of identical capacitated vehicles is located. We are also given the ‘‘traveling costs’’ between the depot and all th...

متن کامل

A novel heuristic algorithm for capacitated vehicle routing problem

The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012